package com.khiker.tree.binary_tree;

public class P111_MinDepth {
	public int minDepth(TreeNode root) {
		if(root==null){
			return 0;
		}
		if (root.left == null) {
			return minDepth(root.right)+1;
		}
		if (root.right == null) {
			return minDepth(root.left)+1;
		}
		return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
	}

//	public int minDepth(TreeNode root) {
//		return root == null ? 0 : Math.min(minDepth(root.left), minDepth(root.right)) + 1;
//	}
}
